Quantitative model-checking of controlled discrete-time Markov processes
نویسندگان
چکیده
منابع مشابه
Quantitative model-checking of controlled discrete-time Markov processes
Article history: Received 21 July 2014 Received in revised form 20 July 2016 Available online xxxx This paper focuses on optimizing probabilities of events of interest defined over general controlled discrete-time Markov processes. It is shown that the optimization over a wide class of ω-regular properties can be reduced to the solution of one of two fundamental problems: reachability and repea...
متن کاملDiscrete Time Markov Processes
What follows is a quick survey of the main ingredients in the theory of discrete-time Markov processes. It is a birds' view, rather than the deenitive \state of the art." To maximize accessibility, the nomenclature of mathematical probability is avoided, although rigor is not sacriiced. To compensate, examples (and counterexamples) abound and the bibliography is annotated. Relevance to control ...
متن کاملSymbolic and Parametric Model Checking of Discrete-Time Markov Chains
We present a language-theoretic approach to symbolic model checking of PCTL over discrete-time Markov chains. The probability with which a path formula is satisfied is represented by a regular expression. A recursive evaluation of the regular expression yields an exact rational value when transition probabilities are rational, and rational functions when some probabilities are left unspecified ...
متن کاملLearning Markov Decision Processes for Model Checking
Constructing an accurate system model for formal model verification can be both resource demanding and time-consuming. To alleviate this shortcoming, algorithms have been proposed for automatically learning system models based on observed system behaviors. In this paper we extend the algorithm on learning probabilistic automata to reactive systems, where the observed system behavior is in the f...
متن کاملDiscrete Time Scale Invariant Markov Processes
In this paper we consider a discrete scale invariant Markov process {X(t), t ∈ R} with scale l > 1. We consider to have some fix number of observations in every scale, say T , and to get our samples at discrete points α, k ∈ W, where α is obtained by the equality l = α and W = {0, 1, . . .}. So we provide a discrete time scale invariant Markov (DT-SIM) process X(·) with parameter space {α, k ∈ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2017
ISSN: 0890-5401
DOI: 10.1016/j.ic.2016.11.006